...通闭图集挖掘算法 关键词：子图挖掘；频繁模式树；频繁模式增长；频繁闭图集；生物网络 [gap=1051]Key words．subgraph mining；FP——Tree；FP——Growth；closed frequent subgraph set；biological networks ..
基于16个网页-相关网页
frequent subgraph mining algorithm 频繁子图挖掘算法
In order to resolve the problem of traditional Apriori algorithm that exists redundancy subgraphs when mining frequent subgraph, a new frequent subgraph mining algorithm called GAI is proposed.
传统Aprior频繁子图挖掘算法中存在大量冗余子图。
参考来源 - 一种新的频繁子图挖掘算法·2,447,543篇论文数据，部分数据来源于NoteExpress
Frequent subgraph mining includes subgraph search and isomorphism problems.
频繁子图挖掘主要涉及到子图搜索和子图同构问题。
With the increasing demand of massive structured data analysis, mining frequent subgraph patterns from graph datasets has been an attention-deserving field.
随着对大量结构化数据分析需求的增长，从图集合中挖掘频繁子图模式已经成为数据挖掘领域的研究热点。
应用推荐